Strictness analysis and denotational abstract interpretation

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Type Inference, Abstract Interpretation and Strictness Analysis

Coppo, M. and A. Ferrari, Type inference, abstract interpretation and strictness analysis, Theoretical Computer Science 121 (1993) 113-143. Filter domains (Coppo et al., 1984) can be seen as abstract domains for the interpretation of (functional) type-free programming languages. What is remarkable is the fact that in filter domains the interpretation of a term is given by the set of its types i...

متن کامل

Binding-Time Analysis and Strictness Analysis by Abstract Interpretation

Given a description of inputs and parameters in a program, a Binding-Time Analysis determines parts of a program which can be evaluated at compile-time. A Strictness Analysis determines parts of a program, whose early evaluation does not change the value of the result. In this paper , we present an analysis which subsumes both analyses for a rst-order functional language. The analysis is formul...

متن کامل

Abstract Interpretation From a Denotational-semantics Perspective

interpretation from a denotational-semantics perspective

متن کامل

Analysis of disassembled executable codes by abstract interpretation

The aim of this paper is to dene the abstract domain, abstract operator, abstract semantic, the environments and states of disassembled executable codes as well as a way to analysis the disassembled executable codes. Nowadays, static analysis on disassembled code going to grow. Reverse engineering and malware analysis use this technique. Thus, we tried to perform pluralization the requirements ...

متن کامل

Higher Order Abstract Interpretation and Application to Comportment Analysis Generalizing Strictness Termination Projection and PER Analysis of Functional Languages

The original formulation of abstract interpretation represents program properties by sets A property is understood as the set of semantic values satisfying it Strongest program properties are de ned by the collecting semantics which extends the standard semantics to powersets of semantic values The ap proximation relation corresponding to the logical impli cation of program properties is subset...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Computation

سال: 1988

ISSN: 0890-5401

DOI: 10.1016/0890-5401(88)90041-7